Constructing newR-sequences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing k-radius sequences

An n-ary k-radius sequence is a finite sequence of elements taken from an alphabet of size n such that any two distinct elements of the alphabet occur within distance k of each other somewhere in the sequence. These sequences were introduced by Jaromczyk and Lonc to model a caching strategy for computing certain functions on large data sets such as medical images. Let fk(n) be the shortest leng...

متن کامل

Newr Drugs Oral hypoglycaemic agents

ideas well, those who waffle, those who are obstructive, and those who always try to help. There are some who are always listened to with respect and those who lose the audience straightaway. Committee work is now a vital part of the work of a doctor who is concerned with getting the best he can for the National Health Service and those it serves and those in its service. Those who recognise it...

متن کامل

Newr Physics Results from ARGUS

New restits from ARGUS on r physics are presented: the m~urement of the r mass and the measurement of the decay r+ p-VT. The irnpfications on lepton university, v, mass, structure of the wed interaction and the v, spin w~ be discussed. Introduction A rich field of physics is accessible to detectors tding data at e+estorage rings which operate in the center-of-mass energy range corresponding to ...

متن کامل

Constructing Structure in Number Sequences

This paper reports on a design experiment in the domain of number sequences conducted in the course of the WebLabs project1. In this study, we designed and tested a set of activities in which 13-14 year old students use the ToonTalk programming environment to construct models of sequences and series, and then use the WebReports web-based collaboration system to share these models and their obse...

متن کامل

Constructing Orthogonal de Bruijn Sequences

A (σ, k)-de Bruijn sequence is a minimum length string on an alphabet set of size σ which contains all σ k-mers exactly once. Motivated by an application in synthetic biology, we say a given collection of de Bruijn sequences are orthogonal if no two of them contain the same (k + 1)-mer; that is, the length of their longest common substring is k. In this paper, we show how to construct large col...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1977

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1977.71.133